Rectangular Partitioning
نویسنده
چکیده
Motivation The motivation for Rectangular Partitioning comes from my work. The application I help create has forms that can be designed by third parties, and it also has a layout engine that makes it easy to change the layout of a form based on the size of the form and its contents. The layout engine takes as it’s input a table of cells and their contents, along with attributes specifying how a given cell, row, or column should behave (i.e. expand when the form expands, alignment of controls, etc.). The table of cells may have controls that overlap multiple cells, but each cell may contain at most one control. Third party form designers don’t have direct access to this layout engine, and so we created a conversion from the form they designed to the layout engine input by subdividing the form space into rows and columns based on the placement of individual controls, which are all rectangular. Minimizing the number of rows plus columns is important to the running time of the layout engine, so that is our goal.
منابع مشابه
Partitioning Sparse Rectangular Matrices for Parallel Processing?
We are interested in partitioning sparse rectangular matrices for parallel processing. The partitioning problem has been well-studied in the square symmetric case, but the rectangular problem has received very little attention. We will formalize the rectangular matrix partitioning problem and discuss several methods for solving it. We will extend the spectral partitioning method for symmetric m...
متن کاملOptimal Partitioning for Spatial Data
It is desirable to design partitioning techniques that minimize the I/O time incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for diierent types of queries. In particular, we show that hexagonal partitioning has optimal I/O cost for circular queries compared to all possible non-overlapping partitioning techniques th...
متن کاملA Geometric Approach for Partitioning N-Dimensional Non-rectangular Iteration Spaces
Parallel loops account for the greatest percentage of program parallelism. The degree to which parallelism can be exploited and the amount of overhead involved during parallel execution of a nested loop directly depend on partitioning, i.e., the way the different iterations of a parallel loop are distributed across different processors. Thus, partitioning of parallel loops is of key importance ...
متن کاملOptimal Partitioning for Efficient I/O in Spatial Databases
It is desirable to design partitioning techniques that minimize the I/O time incurred during query execution in spatial databases. In this paper, we explore optimal partitioning techniques for spatial data for diierent types of queries, and develop multi-disk allocation techniques that maximize the degree of I/O parallelism obtained during the retrieval. We show that hexagonal partitioning has ...
متن کاملRelations Between Two Common Types of Rectangular Tilings
Partitioning a multi-dimensional data set (array) into rectangular regions subject to some constraints (error measures) is an important problem arising from applications in parallel computing, databases, VLSI design, and so on. In this paper, we consider two most common types of partitioning used in practice: the Arbitrary partitioning and (p × p) partitioning, and study their relationships und...
متن کاملInproved Bounds for Rectangular and Guillotine Partitions
We study the problem of partitioning a rectangle S with a set of interior points Q into rectangles by introducing a set of line segments of least total length. The set of partitioning line segments must include every point in Q. Since this prob/em is computationally intractable (NP-hard), several approximation algorithms for its solution have been developed. In this paper we show that the lengt...
متن کامل